Robust Principal Component Analysis for Background Subtraction: Systematic Evaluation and Comparative Analysis
نویسندگان
چکیده
The analysis and understanding of video sequences is currently quite an active research field. Many applications such as video surveillance, optical motion capture or those of multimedia need to first be able to detect the objects moving in a scene filmed by a static camera. This requires the basic operation that consists of separating the moving objects called "foreground" from the static information called "background". Many background subtraction methods have been developed (Bouwmans et al. (2010); Bouwmans et al. (2008)). A recent survey (Bouwmans (2009)) shows that subspace learning models are well suited for background subtraction. Principal Component Analysis (PCA) has been used to model the background by significantly reducing the data’s dimension. To perform PCA, different Robust Principal Components Analysis (RPCA) models have been recently developped in the literature. The background sequence is then modeled by a low rank subspace that can gradually change over time, while the moving foreground objects constitute the correlated sparse outliers. However, authors compare their algorithm only with the PCA (Oliver et al. (1999)) or another RPCA model. Furthermore, the evaluation is not made with the datasets and the measures currently used in the field of background subtraction. Considering all of this, we propose to evaluate RPCA models in the field of video-surveillance. Contributions of this chapter can be summarized as follows:
منابع مشابه
Online Robust Principal Component Analysis with Change Point Detection
Robust PCA methods are typically batch algorithms which requires loading all observations into memory before processing. This makes them inefficient to process big data. In this paper, we develop an efficient online robust principal component methods, namely online moving window robust principal component analysis (OMWRPCA). Unlike existing algorithms, OMWRPCA can successfully track not only sl...
متن کاملRandomized low-rank Dynamic Mode Decomposition for motion detection
This paper introduces a fast algorithm for randomized computation of a low-rank Dynamic Mode Decomposition (DMD) of a matrix. Here we consider this matrix to represent the development of a spatial grid through time e.g. data from a static video source. DMD was originally introduced in the fluid mechanics community, but is also suitable for motion detection in video streams and its use for backg...
متن کاملAn application of principal component analysis and logistic regression to facilitate production scheduling decision support system: an automotive industry case
Production planning and control (PPC) systems have to deal with rising complexity and dynamics. The complexity of planning tasks is due to some existing multiple variables and dynamic factors derived from uncertainties surrounding the PPC. Although literatures on exact scheduling algorithms, simulation approaches, and heuristic methods are extensive in production planning, they seem to be ineff...
متن کاملRobust Principal Component Analysis and Fractal Methods to Delineate Mineralization-Related Hydrothermally-Altered Zones from ASTER Data: A Case Study of Dehaj Terrain, Central Iran
The Dehaj area, located in the southern part of the Urumieh-Dokhtar magmatic belt, is a well-endowed terrain hosting a number of world-class porphyry copper deposits. These deposits are all hosted in an acidic to intermediate volcano-plutonic sequence greatly affected by various types of the hydrothermal alterations, whether argillic, phyllic or propylitic. Although there are a handful of hithe...
متن کاملpROST : A Smoothed Lp-norm Robust Online Subspace Tracking Method for Realtime Background Subtraction in Video
An increasing number of methods for background subtraction use Robust PCA to identify sparse foreground objects. While many algorithms use the `1-norm as a convex relaxation of the ideal sparsifying function, we approach the problem with a smoothed `p-norm and present pROST, a method for robust online subspace tracking. The algorithm is based on alternating minimization on manifolds. Implemente...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012